Nuprl Lemma : combine-ecl-tuples2_wf 11,40

ds:fpf(Id; x.Type), da:fpf(Knd; k.Type), A,B:ecl-trans-tuple{i:l}(dsda),
f:((?)()()), g:().
combine-ecl-tuples2(ABfg ecl-trans-tuple{i:l}(dsda
latex


Definitionst  T, x:AB(x), A  B, P  Q, False, A, , decl-state(ds), ma-valtype(dak), Unit, , ff, , xt(x), t.2, t.1, bor(pq), reduce(fkas), Knd, (x  l), b, prop{i:l}, b, P  Q, P  Q, append(asbs), EqDecider(T), if b then t else f fi , subtype(ST), combine-halt-info(eaebfgx), merge(asbs), , spreadn(ua,b,c,d,e,f,g.v(a;b;c;d;e;f;g)), let x = a in b(x), combine-ecl-tuples2(ABfg), ecl-trans-tuple{i:l}(dsda), Id, fpf(Aa.B(a)), Kind-deq, deq-member(eqxL)
Lemmasecl-trans-tuple wf, fpf wf, Id wf, it wf, merge wf, combine-halt-info wf, nat wf, ifthenelse wf, append wf, eqtt to assert, eqff to assert, iff transitivity, assert of bnot, not functionality wrt iff, assert-deq-member, deq-member wf, bnot wf, not wf, assert wf, l member wf, Knd wf, Kind-deq wf, reduce wf, bor wf, nat plus inc, pi1 wf, pi2 wf, nat plus wf, bfalse wf, bool wf, unit wf, ma-valtype wf, decl-state wf, le wf

origin